Modules and Logic Programming
نویسندگان
چکیده
We study conditions for a concurrent construction of proof-nets in the framework developed by Andreoli in recent papers. We define specific correctness criteria for that purpose. We first study closed modules (i.e. validity of the execution of a logic program), then extend the criterion to open modules (i.e. validity during the execution) distinguishing criteria for acyclicity and connectability in order to allow incremental verification.
منابع مشابه
Mutually Exclusive Modules in Logic Programming
Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form D0&D1 where D0, D1 are a conjunction of Horn clauses and & is a linear logic connective. Solving a goal G using D0&D1 – ex(D0&D1, G) – has the following operational semantics: choose a successful one between ex(D0, G) and ex(...
متن کاملOn the Correctness of the Replacement Operation for CLP Modules
In this paper we study the replacement transformation for Constraint Logic Programming modules. We deene new applicability conditions which guarantee the correctness of the operation also wrt module's composition: under these conditions, the original and the transformed modules have the same observable properties also when they are composed with other modules. The applicability conditions are n...
متن کاملLogic Modules for Communicating Distributed Agents
The development of isolated agents involves the manipulation of components such as actions, mental attitudes and decisions. Multi-agent systems have to deal with these components from diierent agents, without to forget the privacy and autonomy of each agent. For programming simple agents, both object-oriented and logic paradigms have shown advantages in terms of behavior encapsulation and menta...
متن کاملA Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملConflicts in Generalised Modular Logic Programming
Modularity has been studied extensively in conventional logic programming and incorporating modularity into Answer Set Programming has also become popular in the last few years. A major approach is Oikarinnen and JanhunenÕs Gaifman-Shapiro-style architecture of program modules, which provides the composition of program modules. Recently one shortcoming to their approach, imposed in order to ens...
متن کاملFormal Reasoning about Modules, Reuse, and Their Correctness Submitted To: International Conference on Formal and Applied Practical Reasoning ? Forschungsbericht Aida{95{10 Formal Reasoning about Modules, Reuse, and Their Correctness ?
We present a formalisation of modules that are correct, and (correctly) reusable in the sense that composition of modules preserves both correctness and reusability. We also introduce a calculus for formally reasoning about the construction of such modules. 1 Introduction Modular programming has been around for a long time, and has more recently evolved into object-oriented programming (e.g. 11...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.LO/0411029 شماره
صفحات -
تاریخ انتشار 2004